Complementarity Constraint Quali cations and Simpli ed B-Stationarity Conditions for Mathematical Programs with Equilibrium Constraints
نویسندگان
چکیده
With the aid of some novel complementarity constraint quali cations, we derive some simpli ed primal-dual characterizations of a B-stationary point for a mathematical program with complementarity constraints (MPEC). The approach is based on a locally equivalent piecewise formulation of such a program near a feasible point. The simpli ed results, which rely heavily on a careful dissection and improved understanding of the tangent cone of the feasible region of the program, bypass the combinatorial characterization that is intrinsic to B-stationarity.
منابع مشابه
Complementarity Constraint Qualifications and Simplified B-Stationarity Conditions for Mathematical Programs with Equilibrium Constraints
With the aid of some novel complementarity constraint quali cations, we derive some simpli ed primal-dual characterizations of a B-stationary point for a mathematical program with complementarity constraints (MPEC). The approach is based on a locally equivalent piecewise formulation of such a program near a feasible point. The simpli ed results, which rely heavily on a careful dissection and im...
متن کاملSolving Mathematical Programs with Equilibrium Constraints
This paper aims at developing effective numerical methods for solving mathematical programs with equilibrium constraints. Due to the existence of complementarity constraints, the usual constraint qualifications do not hold at any feasible point, and there are various stationarity concepts such as Clarke, Mordukhovich, and strong stationarities that are specially defined for mathematical program...
متن کاملThe New Butter y Relaxation Method for Mathematical Programs with Complementarity Constraints
We propose a new family of relaxation schemes for mathematical programs with complementarity constraints that extends the relaxations of Kadrani, Dussault, Bechakroun from 2009 and the one of Kanzow & Schwartz from 2011. We discuss the properties of the sequence of relaxed non-linear program as well as stationarity properties of limiting points. A sub-family of our relaxation schemes has the de...
متن کاملOptimality Conditions for Disjunctive Programs Based on Generalized Differentiation with Application to Mathematical Programs with Equilibrium Constraints
We consider optimization problems with a disjunctive structure of the constraints. Prominent examples of such problems are mathematical programs with equilibrium constraints or vanishing constraints. Based on the concepts of directional subregularity and their characterization by means of objects from generalized differentiation, we obtain the new stationarity concept of extended M-stationarity...
متن کامل! Mathematical Programs with Equilibrium Constraints and Applications to Control
We discuss recent advances in mathematical programs with equilibrium constraints (MPECs). We describe the challenges posed by these problems and the current algorithmic solutions. We emphasize in particular the use of the elastic mode approach. We also present initial investigations in applications of MPECs to control problems. Ceywords: Complementarity Constraints, Equilibrium Constraints, Ela...
متن کامل